Copy Detection Technique with Enhanced Efficiency by using Substring Comparison Algorithm
نویسندگان
چکیده
منابع مشابه
A Technique for Improving Web Mining using Enhanced Genetic Algorithm
World Wide Web is growing at a very fast pace and makes a lot of information available to the public. Search engines used conventional methods to retrieve information on the Web; however, the search results of these engines are still able to be refined and their accuracy is not high enough. One of the methods for web mining is evolutionary algorithms which search according to the user interests...
متن کاملCopy- Move Forgery Detection Using Passive Technique
An extensive growth in digital technology has resulted in tampering of image. Image plays an important role in today’s digital world. Powerful image editing tools has made it difficult to determine whether the image is authentic or forged. The main objective of this paper is to detect the forgery in which a part of the image is copied and pasted on to same image without the information of the o...
متن کاملEnhanced Passive copy – paste Tampering Detection Technique for Digital Images
Digital images are powerful and widely used communication medium in many fields like medical imaging, digital forensics, surveillance, journalism, etc. The availability of sophisticated digital image technology has given rise to image forgery. The forgeries are very difficult for a human eye to detect. Passive tampering detection method aims to detect the tampering areas in the digital images w...
متن کاملCopy-move Detection Algorithm Efficiency Increase Using Binary Space Partitioning Trees
Duplicates embedding is one of the most frequently used type of digital image change. The copy-move procedure includes copying an image fragment from one part and pasting it to another part of the same image. Moreover, this fragment can be changed using some transformations, like affine or contrast enhancement. Existing copy-move detection methods consist of two main steps: feature calculation ...
متن کاملA Template Discovery Algorithm by Substring Amplification
In this paper, we consider to find a set of substrings common to given strings. We define this problem as the template discovery problem which is, given a set of strings generated by some fixed but unknown pattern, to find the constant parts of the pattern. A pattern is a string over constant and variable symbols. It generates strings by replacing variables into constant strings. We assume that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Security and Its Applications
سال: 2016
ISSN: 1738-9976,1738-9976
DOI: 10.14257/ijsia.2016.10.12.23